Fast recovery from failures in a chronologically ordered log-structured key-value storage system

ABSTRACT

One embodiment provides a method for recovery after failure using a checkpoint in a chronological log-structured key-value store in a system including writing tombstone entries in a log structure for dirty checkpoint records to point to data records in an aborted target slot.

BACKGROUND

Typical log-structured storage systems store record data in temporalorder in a “log.” These typical systems allow basic primitiveoperations, such as insert, update, delete, read. Each update of dataresults in a new record being inserted at the tail of the “log.” Eachdelete results in a tombstone object being inserted at the tail of thelog. Additionally, background garbage collection process compacts thedata reclaiming space that does not contain valid data.

SUMMARY

Embodiments relate to fast recovery from failures in a chronologicallyordered log-structured key-value store. One embodiment provides a methodfor recovery after failure using a checkpoint in a chronologicallog-structured key-value store in a system including writing tombstoneentries in a log structure for dirty checkpoint records to point to datarecords in an aborted target slot.

These and other features, aspects and advantages of the embodiments willbecome understood with reference to the following description, appendedclaims and accompanying figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a cloud computing environment, according to anembodiment;

FIG. 2 depicts a set of abstraction model layers, according to anembodiment;

FIG. 3 is a network architecture for retrospective snapshots inlog-structured storage systems, according to an embodiment;

FIG. 4 shows a representative hardware environment that may beassociated with the servers and/or clients of FIG. 1, according to anembodiment;

FIG. 5 is a block diagram illustrating a processor for fast recoveryfrom failures in a chronologically ordered log-structured key-valuestore in log-structured storage systems, according to an embodiment;

FIG. 6 illustrates an example checkpoint record pointing to a garbagecollection slot, according to an embodiment; and

FIG. 7 illustrates a block diagram for a process for recovery fromfailures in a chronologically ordered log-structured key-value store,according to one embodiment.

DETAILED DESCRIPTION

The descriptions of the various embodiments have been presented forpurposes of illustration, but are not intended to be exhaustive orlimited to the embodiments disclosed. Many modifications and variationswill be apparent to those of ordinary skill in the art without departingfrom the scope and spirit of the described embodiments. The terminologyused herein was chosen to best explain the principles of theembodiments, the practical application or technical improvement overtechnologies found in the marketplace, or to enable others of ordinaryskill in the art to understand the embodiments disclosed herein.

It is understood in advance that although this disclosure includes adetailed description of cloud computing, implementation of the teachingsrecited herein are not limited to a cloud computing environment. Rather,embodiments are capable of being implemented in conjunction with anyother type of computing environment now known or later developed.

One or more embodiments relate to fast recovery from failures in achronologically ordered log-structured key-value store. One embodimentprovides a method for recovery after failure using a checkpoint in achronological log-structured key-value store in a system includingrecording, by a processor, a system state prior to an aborted garbagecollection operation. The processor writes tombstone entries in a logstructure for dirty checkpoint records to point to data records in anaborted target slot. New checkpoint records are inserted in the logstructure for the dirty checkpoint records.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g., networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines (VMs), and services)that can be rapidly provisioned and released with minimal managementeffort or interaction with a provider of the service. This cloud modelmay include at least five characteristics, at least three servicemodels, and at least four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded and automatically, without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneous,thin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or data center).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned and, in some cases, automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active consumer accounts). Resource usage canbe monitored, controlled, and reported, thereby providing transparencyfor both the provider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isthe ability to use the provider's applications running on a cloudinfrastructure. The applications are accessible from various clientdevices through a thin client interface, such as a web browser (e.g.,web-based email). The consumer does not manage or control the underlyingcloud infrastructure including network, servers, operating systems,storage, or even individual application capabilities, with the possibleexception of limited consumer-specific application configurationsettings.

Platform as a Service (PaaS): the capability provided to the consumer isthe ability to deploy onto the cloud infrastructure consumer-created oracquired applications created using programming languages and toolssupported by the provider. The consumer does not manage or control theunderlying cloud infrastructure including networks, servers, operatingsystems, or storage, but has control over the deployed applications andpossibly application-hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is the ability to provision processing, storage, networks, andother fundamental computing resources where the consumer is able todeploy and run arbitrary software, which can include operating systemsand applications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting for loadbalancing between clouds).

A cloud computing environment is a service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

Referring now to FIG. 1, an illustrative cloud computing environment 50is depicted. As shown, cloud computing environment 50 comprises one ormore cloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as private, community,public, or hybrid clouds as described hereinabove, or a combinationthereof. This allows the cloud computing environment 50 to offerinfrastructure, platforms, and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 2 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 2, a set of functional abstraction layers providedby the cloud computing environment 50 (FIG. 1) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 2 are intended to be illustrative only and embodiments are notlimited thereto. As depicted, the following layers and correspondingfunctions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, a management layer 80 may provide the functionsdescribed below. Resource provisioning 81 provides dynamic procurementof computing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment and billing or invoicing for consumption of theseresources. In one example, these resources may comprise applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and fast recovery from failures in achronologically ordered log-structured key-value store processing 96. Asmentioned above, all of the foregoing examples described with respect toFIG. 2 are illustrative only, and the embodiments are not limited tothese examples.

It is understood all functions of one or more embodiments as describedherein may be typically performed by the processing system 300 (FIG. 3)or the autonomous cloud environment 410 (FIG. 4), which can be tangiblyembodied as hardware processors and with modules of program code.However, this need not be the case for non-real-time processing. Rather,for non-real-time processing the functionality recited herein could becarried out/implemented and/or enabled by any of the layers 60, 70, 80and 90 shown in FIG. 2.

It is reiterated that although this disclosure includes a detaileddescription on cloud computing, implementation of the teachings recitedherein are not limited to a cloud computing environment. Rather, theembodiments may be implemented with any type of clustered computingenvironment now known or later developed.

FIG. 3 illustrates a network architecture 300, in accordance with oneembodiment. As shown in FIG. 3, a plurality of remote networks 302 areprovided, including a first remote network 304 and a second remotenetwork 306. A gateway 301 may be coupled between the remote networks302 and a proximate network 308. In the context of the present networkarchitecture 300, the networks 304, 306 may each take any formincluding, but not limited to, a LAN, a WAN, such as the Internet,public switched telephone network (PSTN), internal telephone network,etc.

In use, the gateway 301 serves as an entrance point from the remotenetworks 302 to the proximate network 308. As such, the gateway 301 mayfunction as a router, which is capable of directing a given packet ofdata that arrives at the gateway 301, and a switch, which furnishes theactual path in and out of the gateway 301 for a given packet.

Further included is at least one data server 314 coupled to theproximate network 308, which is accessible from the remote networks 302via the gateway 301. It should be noted that the data server(s) 314 mayinclude any type of computing device/groupware. Coupled to each dataserver 314 is a plurality of user devices 316. Such user devices 316 mayinclude a desktop computer, laptop computer, handheld computer, printer,and/or any other type of logic-containing device. It should be notedthat a user device 311 may also be directly coupled to any of thenetworks in some embodiments.

A peripheral 320 or series of peripherals 320, e.g., facsimile machines,printers, scanners, hard disk drives, networked and/or local storageunits or systems, etc., may be coupled to one or more of the networks304, 306, 308. It should be noted that databases and/or additionalcomponents may be utilized with, or integrated into, any type of networkelement coupled to the networks 304, 306, 308. In the context of thepresent description, a network element may refer to any component of anetwork.

According to some approaches, methods and systems described herein maybe implemented with and/or on virtual systems and/or systems, whichemulate one or more other systems, such as a UNIX system that emulatesan IBM z/OS environment, a UNIX system that virtually hosts a MICROSOFTWINDOWS environment, a MICROSOFT WINDOWS system that emulates an IBMz/OS environment, etc. This virtualization and/or emulation may beimplemented through the use of VMWARE software in some embodiments.

FIG. 4 shows a representative hardware system 400 environment associatedwith a user device 416 and/or server 314 of FIG. 3, in accordance withone embodiment. In one example, a hardware configuration includes aworkstation having a central processing unit 410, such as amicroprocessor, and a number of other units interconnected via a systembus 412. The workstation shown in FIG. 4 may include a Random AccessMemory (RAM) 414, Read Only Memory (ROM) 416, an I/O adapter 418 forconnecting peripheral devices, such as disk storage units 420 to the bus412, a user interface adapter 422 for connecting a keyboard 424, a mouse426, a speaker 428, a microphone 432, and/or other user interfacedevices, such as a touch screen, a digital camera (not shown), etc., tothe bus 412, communication adapter 434 for connecting the workstation toa communication network 435 (e.g., a data processing network) and adisplay adapter 436 for connecting the bus 412 to a display device 438.

In one example, the workstation may have resident thereon an operatingsystem, such as the MICROSOFT WINDOWS Operating System (OS), a MAC OS, aUNIX OS, etc. In one embodiment, the system 400 employs a POSIX® basedfile system. It will be appreciated that other examples may also beimplemented on platforms and operating systems other than thosementioned. Such other examples may include operating systems writtenusing JAVA, XML, C, and/or C++ language, or other programming languages,along with an object oriented programming methodology. Object orientedprogramming (OOP), which has become increasingly used to develop complexapplications, may also be used.

FIG. 5 is a block diagram illustrating a processing node 500 for fastrecovery from failures in a chronologically ordered log-structuredkey-value store in log-structured storage systems, according to anembodiment. The term garbage collection (GC) refers to reclaiming “diskspace” occupied by stale entries in the log. For example, when a recordis inserted, an entry is added to the tail of the log. When the samerecord is deleted, a tombstone entry is added to the tail of the log.The tombstone entry refers to the original location of the data on diskas created by the insert. The disk space occupied by the originalinserted record may be garbage collected (provided the system is notmaintaining older versions). Stale data may be the result of recordsthat have been deleted or updated. Updates result in stale data becauseolder versions of the data that are maintained in the log are no longerneeded. Note that in a log-structured store, every insert, update ordelete operation results in a record being inserted at the tail of thelog.

In one embodiment, the processing node 500 includes one or moreprocessors 510, a checkpoint interface 530 and a memory 520. In oneembodiment, each processor(s) 510 performs processing for fast recoveryfrom failures in a chronologically ordered log-structured key-valuestore in log-structured storage systems. Log structured storage system:complete in-memory index to quickly access record given the key, whereindex entry is represented by: <key, log address>. In a log-structuredstorage system, there is a need to quickly reconstruct an index duringrestart after failure or after shutdown. A naïve option may includereplay of the log from the beginning. This option, however, istime-consuming and resource intensive. In one embodiment, the checkpointinterface 530 provides for processing including a checkpoint of theindex. For recovery from checkpoints, the checkpoint interface 530 mayperform processing where checkpoints may occur concurrently with garbagecollection. As a result, a checkpoint operation may record the positionof a key on the “garbage collection target slot.” “Rollback” of a GCoperation will void the contents on the GC target slot. Reads will fail,which results in data loss. Subsequent recovery points to an invalidlocation resulting in data loss.

In one embodiment, another approach by the checkpoint interface 530 mayinclude to disallow checkpoint operations. Checkpoints, if available, donot proceed concurrently with GC. This approach results in longerelapsed time to complete a checkpoint operation, and hence longerrecovery time. This approach also impacts availability negatively byresulting in longer restart times after a failure.

In one embodiment, GC is performed by the checkpoint interface 530 as atransaction. Transaction processing divides information processing intoindividual, indivisible operations known as transactions. Eachtransaction must succeed or fail as a complete unit, and can never beonly partially complete. In one embodiment, the checkpoint interface 530performs rollback of a GC transaction in case of failure. GC transactionrecords include: <target slot (TS), victim slot (VS), begin offset intarget slot (BO)>. In one embodiment, the GC target region is the <BO,end of slot> region on the GC target slot. GC transaction records beginand end on the GC transaction.

In one embodiment, the checkpoint interface 530 performs GC rollback asfollows. The checkpoint interface 530 reads the recovery log to identifyan incomplete GC target slot and victim slot. The checkpoint interface530 begins index reconstruction from the checkpoint such that: 1) if aslot is a GC target slot & offset>=BO, skip until end of slot andcontinue to the next slot; 2) if a checkpoint record A points to a GCtarget region: a) read the record in the GC target region pointed to byA (referred to as record B); b) insert a tombstone record for thecheckpoint record A recording the key, and the contents of checkpointrecord A (this is to allow subsequent use of the GC target slot regioncontaining record B); c) insert a new checkpoint record using B'sback-pointer pointing to the corresponding GC victim slot record(referred to as record C).

Next, the checkpoint interface 530 ends index reconstruction, zeros-outa target slot TS from offset BO until the end of the slot, and insertsan “Abort record for the garbage collection transaction” into therecovery log. At the end of the recovery, the system state is identicalto the state of the system before GC processing.

FIG. 6 illustrates an example 600 checkpoint record pointing to a GCslot, according to an embodiment. The index 610 of the example 600includes keys in the left column and slot mapping in the right column.In one example, K1 refers to slot 1 620 and offset 2; K2 refers to slot1 620 and offset 3, etc. In the example 600, the slots shown includeslot 1 620, slot 51 630, slot 3 640 and slot 4 650. The victim slot VSis shown as slot 3 640, and the target slot TS is shown as slot 51 630.In this example 600, the index 610 includes an incorrect entry 611 thatpoints to a zeroed out location. The back-pointer (points to previousaddress) chain 660 shows the pointer from slot 4 650 (k8) to slot 51 630and offset 6 (k8). The checkpoint record 670 refers to the checkpointrecord pointing to the GC target slot.

FIG. 7 illustrates a block diagram for a process 700 for recovery fromfailures in a chronologically ordered log-structured key-value store,according to one embodiment. In one embodiment, block 710 in process 700includes recording, by a processor (e.g., by a processor 510, FIG. 5), asystem state prior to an aborted GC operation. In block 720, process 700performs writing, by the processor, tombstone entries in a log structurefor dirty checkpoint records to point to data records in an abortedtarget slot. In block 730, process 700 inserts new checkpoint recordsfor the dirty checkpoint records in the log structure.

In one embodiment, in process 700 the system may be a chronologicallyordered log-structured key-value store system. In one embodiment, forprocess 700 the GC operation is a GC transaction. For process 700, theaborted target slot may be a target slot of the GC operation.

In one embodiment, process 700 may further include providing forcheckpoint operations to proceed concurrently with GC processing whilemaintaining chronological order of data using processing to restore thesystem to a consistent state after failure during the GC operation(e.g., a failed transaction).

In one embodiment, process 700 may further include reading a recoverylog after the aborted GC operation, and identifying an incomplete GCtarget slot and an incomplete GC victim slot.

In one embodiment, process 700 may further include recording the GCtransaction on a separate recovery log. In one embodiment, process 700may additionally include zeroing out a region of the target slot of thelog structure from a begin offset in the target slot until an end of thetarget slot, and inserting an abort record for the GC transaction intothe separate recovery log.

As will be appreciated by one skilled in the art, aspects of theembodiments may be embodied as a system, method or computer programproduct. Accordingly, aspects of the embodiments may take the form of anentirely hardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,aspects of the embodiments may take the form of a computer programproduct embodied in one or more computer readable medium(s) havingcomputer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of theembodiments may be written in any combination of one or more programminglanguages, including an object oriented programming language such asJava, Smalltalk, C++ or the like and conventional procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The program code may execute entirely on the user's computer,partly on the user's computer, as a stand-alone software package, partlyon the user's computer and partly on a remote computer or entirely onthe remote computer or server. In the latter scenario, the remotecomputer may be connected to the user's computer through any type ofnetwork, including a local area network (LAN) or a wide area network(WAN), or the connection may be made to an external computer (forexample, through the Internet using an Internet Service Provider).

Aspects of the embodiments are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to the embodiments. Itwill be understood that each block of the flowchart illustrations and/orblock diagrams, and combinations of blocks in the flowchartillustrations and/or block diagrams, can be implemented by computerprogram instructions. These computer program instructions may beprovided to a processor of a general purpose computer, special purposecomputer, or other programmable data processing apparatus to produce amachine, such that the instructions, which execute via the processor ofthe computer or other programmable data processing apparatus, createmeans for implementing the functions/acts specified in the flowchartand/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments. In this regard, each block in the flowchart or blockdiagrams may represent a module, segment, or portion of instructions,which comprises one or more executable instructions for implementing thespecified logical function(s). In some alternative implementations, thefunctions noted in the block may occur out of the order noted in thefigures. For example, two blocks shown in succession may, in fact, beexecuted substantially concurrently, or the blocks may sometimes beexecuted in the reverse order, depending upon the functionalityinvolved. It will also be noted that each block of the block diagramsand/or flowchart illustration, and combinations of blocks in the blockdiagrams and/or flowchart illustration, can be implemented by specialpurpose hardware-based systems that perform the specified functions oracts or carry out combinations of special purpose hardware and computerinstructions.

References in the claims to an element in the singular is not intendedto mean “one and only” unless explicitly so stated, but rather “one ormore.” All structural and functional equivalents to the elements of theabove-described exemplary embodiment that are currently known or latercome to be known to those of ordinary skill in the art are intended tobe encompassed by the present claims. No claim element herein is to beconstrued under the provisions of 35 U.S.C. section 112, sixthparagraph, unless the element is expressly recited using the phrase“means for” or “step for.”

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the embodiments.As used herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the embodiments has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the embodiments in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the embodiments. Theembodiment was chosen and described in order to best explain theprinciples of the embodiments and the practical application, and toenable others of ordinary skill in the art to understand the variousembodiments with various modifications as are suited to the particularuse contemplated.

What is claimed is:
 1. A method for recovery after failure using acheckpoint in a chronological log-structured key-value store in a systemcomprising: writing, by a processor, tombstone entries in a logstructure, the tombstone entries being for dirty checkpoint records thatpoint to data records in an aborted target slot.
 2. The method of claim1, further comprising: recording, by the processor, a system state, therecorded system state being prior to an aborted garbage collectionoperation; wherein the system comprises a chronologically orderedlog-structured key-value store system.
 3. The method of claim 2, furthercomprising: inserting new checkpoint records for the dirty checkpointrecords in the log structure; wherein the garbage collection operationcomprises a garbage collection transaction.
 4. The method of claim 3,wherein the aborted target slot is a target slot of the garbagecollection operation.
 5. The method of claim 3, further comprising:providing for checkpoint operations to proceed concurrently with garbagecollection processing, the checkpoint operations being provided while achronological order of data is maintained by using processing to restorethe system to a consistent state after a failure during the garbagecollection operation.
 6. The method of claim 3, further comprising:reading a first recovery log after the aborted garbage collectionoperation; and identifying an incomplete garbage collection target slotand an incomplete garbage collection victim slot.
 7. The method of claim6, further comprising: recording the garbage collection transaction on asecond recovery log.
 8. The method of claim 7, further comprising:zeroing out a region of the aborted target slot of the log structurefrom a begin offset in the target slot until an end of the abortedtarget slot; and inserting an abort record for the garbage collectiontransaction into the second recovery log.
 9. A computer program productfor recovery after failure using a checkpoint in a chronologicallog-structured key-value store in a system, the computer program productcomprising a non-transitory computer readable storage medium havingprogram instructions embodied therewith, the program instructionsexecutable by a processor to cause the processor to: write, by theprocessor, tombstone entries in a log structure, the tombstone entriesbeing for dirty checkpoint records that point to data records in anaborted target slot.
 10. The computer program product of claim 9,further comprising program instructions executable by the processor tocause the processor to: record, by the processor, a system state, therecorded system state being prior to an aborted garbage collectionoperation; wherein the system comprises a chronologically orderedlog-structured key-value store system.
 11. The computer program productof claim 10, further comprising program instructions executable by theprocessor to cause the processor to: insert, by the processor, newcheckpoint records for the dirty checkpoint records in the logstructure; wherein: the garbage collection operation comprises a garbagecollection transaction; and the aborted target slot is a target slot ofthe garbage collection transaction.
 12. The computer program product ofclaim 11, further comprising program instructions executable by theprocessor to cause the processor to: provide, by the processor, forcheckpoint operations to proceed concurrently with garbage collectionprocessing, the checkpoint operations being provided while achronological order of data is maintained by using processing to restorethe system to a consistent state after a failure during the garbagecollection transaction.
 13. The computer program product of claim 11,further comprising program instructions executable by the processor tocause the processor to: read, by the processor, a first recovery logafter the aborted garbage collection operation; and identify, by theprocessor, an incomplete garbage collection target slot and anincomplete garbage collection victim slot.
 14. The computer programproduct of claim 13, further comprising program instructions executableby the processor to cause the processor to: record, by the processor,the garbage collection transaction on a second recovery log.
 15. Thecomputer program product of claim 14, further comprising programinstructions executable by the processor to cause the processor to: zeroout, by the processor, a region of the aborted target slot of the logstructure from a begin offset in the aborted target slot until an end ofthe aborted target slot; and insert, by the processor, an abort recordfor the garbage collection transaction into the second recovery log. 16.An apparatus comprising: a memory storing instructions; and a processorexecuting the instructions to: write tombstone entries in a logstructure, the tombstone entries being for dirty checkpoint records thatpoint to data records in an aborted target slot.
 17. The apparatus ofclaim 16, wherein the processor further executes instructions to: recorda system state for a system, the recorded system state being prior to anaborted garbage collection operation; wherein the system comprises achronologically ordered log-structured key-value store system, and thegarbage collection operation comprises a garbage collection transaction.18. The apparatus of claim 17, wherein the processor further executesinstructions to: insert new checkpoint records for the dirty checkpointrecords in the log structure; wherein the aborted target slot is atarget slot of the garbage collection transaction.
 19. The apparatus ofclaim 18, wherein the processor further executes instructionscomprising: providing for checkpoint operations to proceed concurrentlywith garbage collection processing, the checkpoint operations beingprovided while a chronological order of data is maintained by usingprocessing to restore the system to a consistent state after a failureduring the garbage collection transaction; reading, after the abortedgarbage collection transaction, a first recovery log; and identifying anincomplete garbage collection target slot and an incomplete garbagecollection victim slot.
 20. The apparatus of claim 18, wherein theprocessor further executes instructions comprising: recording thegarbage collection transaction on a second recovery log; zeroing out aregion of the aborted target slot of the log structure from a beginoffset in the aborted target slot until an end of the aborted targetslot; and inserting an abort record for the garbage collectiontransaction into the second recovery log.